an efficient approach for solving layout problems

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision variables as starting and finishing point of departments in area makes it possible to model layout problem so. this paper also provides new technique that models basic constraints of layout problems.